type github.com/andybalholm/brotli.hasherHandle (interface)

Method Implmentations

	Common() *hasherCommon
		(*h10).hasherCommon.Common
		(*h5).hasherCommon.Common
		(*h6).hasherCommon.Common
		(*hashComposite).hasherCommon.Common
		(*hashForgetfulChain).hasherCommon.Common
		(*hashLongestMatchQuickly).hasherCommon.Common
		(*hashRolling).hasherCommon.Common
	FindLongestMatch(dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, distance_cache []int, cur_ix uint, max_length uint, max_backward uint, gap uint, max_distance uint, out *hasherSearchResult)
		(*h10).FindLongestMatch
		(*h5).FindLongestMatch
		(*h6).FindLongestMatch
		(*hashComposite).FindLongestMatch
		(*hashForgetfulChain).FindLongestMatch
		(*hashLongestMatchQuickly).FindLongestMatch
		(*hashRolling).FindLongestMatch
	HashTypeLength() uint
		(*h10).HashTypeLength
		(*h5).HashTypeLength
		(*h6).HashTypeLength
		(*hashComposite).HashTypeLength
		(*hashForgetfulChain).HashTypeLength
		(*hashLongestMatchQuickly).HashTypeLength
		(*hashRolling).HashTypeLength
	Initialize(params *encoderParams)
		(*h10).Initialize
		(*h5).Initialize
		(*h6).Initialize
		(*hashComposite).Initialize
		(*hashForgetfulChain).Initialize
		(*hashLongestMatchQuickly).Initialize
		(*hashRolling).Initialize
	Prepare(one_shot bool, input_size uint, data []byte)
		(*h10).Prepare
		(*h5).Prepare
		(*h6).Prepare
		(*hashComposite).Prepare
		(*hashForgetfulChain).Prepare
		(*hashLongestMatchQuickly).Prepare
		(*hashRolling).Prepare
	PrepareDistanceCache(distance_cache []int)
		(*h10).PrepareDistanceCache
		(*h5).PrepareDistanceCache
		(*h6).PrepareDistanceCache
		(*hashComposite).PrepareDistanceCache
		(*hashForgetfulChain).PrepareDistanceCache
		(*hashLongestMatchQuickly).PrepareDistanceCache
		(*hashRolling).PrepareDistanceCache
	StitchToPreviousBlock(num_bytes uint, position uint, ringbuffer []byte, ringbuffer_mask uint)
		(*h10).StitchToPreviousBlock
		(*h5).StitchToPreviousBlock
		(*h6).StitchToPreviousBlock
		(*hashComposite).StitchToPreviousBlock
		(*hashForgetfulChain).StitchToPreviousBlock
		(*hashLongestMatchQuickly).StitchToPreviousBlock
		(*hashRolling).StitchToPreviousBlock
	Store(data []byte, mask uint, ix uint)
		(*h10).Store
		(*h5).Store
		(*h6).Store
		(*hashComposite).Store
		(*hashForgetfulChain).Store
		(*hashLongestMatchQuickly).Store
		(*hashRolling).Store
	StoreLookahead() uint
		(*h10).StoreLookahead
		(*h5).StoreLookahead
		(*h6).StoreLookahead
		(*hashComposite).StoreLookahead
		(*hashForgetfulChain).StoreLookahead
		(*hashLongestMatchQuickly).StoreLookahead
		(*hashRolling).StoreLookahead
	StoreRange(data []byte, mask uint, ix_start uint, ix_end uint)
		(*h10).StoreRange
		(*h5).StoreRange
		(*h6).StoreRange
		(*hashComposite).StoreRange
		(*hashForgetfulChain).StoreRange
		(*hashLongestMatchQuickly).StoreRange
		(*hashRolling).StoreRange

The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds.